Selected Applications of LLL in Number Theory
نویسنده
چکیده
In this survey, I describe some applications of LLL in number theory. I show in particular how it can be used to solve many different linear problems, to solve quadratic equations, to compute efficiently in number fields...
منابع مشابه
A modified LLL algorithm for change of ordering of Grobner basis
In this paper, a modied version of LLL algorithm, which is a an algorithm with output-sensitivecomplexity, is presented to convert a given Grobner basis with respect to a specic order of a polynomialideal I in arbitrary dimensions to a Grobner basis of I with respect to another term order.Also a comparison with the FGLM conversion and Buchberger method is considered.
متن کاملEffectiveness of casein phosphopeptide-amorphous calcium phosphate and lysozyme, lactoferrin, and lactoperoxidase in reducing Streptococcus mutans counts in dentinal caries.
This study compared the capacity of casein phosphopeptide-amorphous calcium phosphate (CPP-ACP) to that of a combination of lysozyme, lactoferrin, and lactoperoxidase (LLL) in root canal disinfectant for reducing the Streptococcus mutans counts from dentinal caries. Forty human permanent third molars were selected, and flat dentin surfaces were created. Carious lesions were induced using a micr...
متن کاملA Polynomial Time Version of LLL With Deep Insertions
Lattice reduction algorithms have numerous applications in number theory, algebra, as well as in cryptanalysis. The most famous algorithm for lattice reduction is the LLL algorithm. In polynomial time it computes a reduced basis with provable output quality. One early improvement of the LLL algorithm was LLL with deep insertions (DeepLLL). The output of this version of LLL has higher quality in...
متن کاملPotLLL: a polynomial time version of LLL with deep insertions
Lattice reduction algorithms have numerous applications in number theory, algebra, as well as in cryptanalysis. The most famous algorithm for lattice reduction is the LLL algorithm. In polynomial time it computes a reduced basis with provable output quality. One early improvement of the LLL algorithm was LLL with deep insertions (DeepLLL). The output of this version of LLL has higher quality in...
متن کاملPartial LLL Reduction
The Lenstra-Lenstra-Lovasz (LLL) reduction has wide applications in digital communications. It can greatly improve the speed of the sphere decoding (SD) algorithms for solving an integer least squares (ILS) problem and the performance of the Babai integer point, a suboptimal solution to the ILS problem. Recently Ling and Howgrave-Graham proposed the so-called effective LLL (ELLL) reduction. It ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010